Configurations graphs of neighbourhood geometries

نویسندگان

  • Marien Abreu
  • Martin Funk
  • Domenico Labbate
  • Vito Napolitano
چکیده

Configurations of type (κ +1)κ give rise to κ–regular simple graphs via configuration graphs. On the other hand, neighbourhood geometries of C4–free κ–regular simple graphs on κ 2 + 1 vertices turn out to be configurations of type (κ + 1)κ. We investigate which configurations of type (κ +1)κ are equal or isomorphic to the neighbourhood geometry of their configuration graph and conversely. We classify all such graphs and configurations for κ = 3 and for κ = 4 when the graphs admit a centre of radius 2.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Local Characterizations of Geometries

One of the best ways to understand the nature of finite simple groups is through geometries associated with them. This approach for classical and exceptional groups of Lie type has been quite successful and has led to the deveopment of the concept of buildings and polar spaces. The latter have been characterized by simple systems of axioms with a combinatorial-geometric flavour. It has been obs...

متن کامل

Imprimitive Symmetric Graphs

A finite graph Γ is said to be G-symmetric if G is a group of automorphisms of Γ acting transitively on the ordered pairs of adjacent vertices of Γ. In most cases, the group G acts imprimitively on the vertices of Γ, that is, the vertex set of Γ admits a nontrivial G-invariant partition B. The purpose of this thesis is to study such graphs, called imprimitive G-symmetric graphs. In the first pa...

متن کامل

Intersecting designs from linear programming and graphs of diameter two

We investigate l-designs (regular intersecting families) and graphs of diameter 2. The optimal configurations are either projective planes or design-like structures closely related to finite geometries. The new results presented here are corollaries of a recent improvement about uniform hypergraphs with maximal fractional matchings. We propose several open problems.

متن کامل

Quantum contextual finite geometries from dessins d'enfants

We point out an explicit connection between graphs drawn on compact Riemann surfaces defined over the field Q̄ of algebraic numbers — so-called Grothendieck’s dessins d’enfants — and a wealth of distinguished point-line configurations. These include simplices, cross-polytopes, several notable projective configurations, a number of multipartite graphs and some ‘exotic’ geometries. Among them, rem...

متن کامل

Assessment of various rotor tip geometries on a single stage gas turbine performance

Tip leakage loss introduces major part of losses of the rotor in axial gas turbines. Therefore, the rotor blade tip has a considerable effect on rotor efficiency. To understand the flow physics of the rotor tip leakage, we solve the flow field for different tip platforms (passive flow control) and by considering coolant tip injection (active flow control). Various blade tip configurations s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Contributions to Discrete Mathematics

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2008